Replacement algorithms for storage management in relational data bases

The Relational Approach to the Management of Data Bases

Computable Queries for Relational Data Bases

The concept of “reasonable” queries on relational data bases is investigated. We provide an abstract characterization of the class of queries which are computable, and define the completeness of a query language as the property of being precisely powerful enough to express the queries in this class. This definition is then compared with other proposals for measuring the power of query languages...

Algorithms and Coding Techniques for Reliable Data Management and Storage

of the Dissertation Algorithms and Coding Techniques for Reliable Data Management and Storage

Relational Joins for Data on Tertiary Storage

Despite the steady decrease in secondary storage prices, the data storage requirements of many organizations cannot be met economically using secondary storage alone. Tertiary storage offers a lower-cost alternative but is viewed as a second-class citizen in many systems. For instance, the typical solution in bringing tertiary-resident data under the control of a DBMS is to use operating system...

Relational databases for data management in PHENIX

PHENIX is one of the two large experiments at the Relativistic Heavy Ion Collider (RHIC) at Brookhaven National Laboratory (BNL) and archives roughly 100TB of experimental data per year. In addition, large volumes of simulated data are produced at multiple off-site computing centers. For any file catalog to play a central role in data management it has to face problems associated with the need ...